翻訳と辞書 |
Randall Dougherty : ウィキペディア英語版 | Randall Dougherty
Randall Dougherty (born 1961) is an American mathematician. Dougherty has made contributions in widely varying areas of mathematics, including set theory, logic, real analysis, discrete mathematics, computational geometry, information theory and coding theory.〔("Universität Trier: DBLP Bibliography Server" )〕 Dougherty is a three-time winner of the U.S.A. Mathematical Olympiad, 1976, 1977, 1978 and a three-time medalist in the International Mathematical Olympiad. He is also a three-time Putnam Fellow 1978, 1979, 1980.〔("The Mathematical Association of America's William Lowell Putnam Competition" )〕 Dougherty earned his Ph.D. in 1985 at University of California, Berkeley under the direction of Jack Silver.〔 *〕 With Matthew Foreman he showed that the Banach-Tarski decomposition is possible with pieces with the Baire property, solving a problem of Marczewski that remained unsolved for more than 60 years.〔("The Ohio State University Department of Mathematics--Alumni News" ) 〕 With Chris Freiling and Ken Zeger, he showed that linear codes are insufficient to gain the full advantages of network coding.〔Dougherty, Freiling, and Zeger. Insufficiency of Linear Coding in Network Information Flow.() and ()〕 ==Selected publications==
* *
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Randall Dougherty」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|